One-dimensional fragment over words and trees

Abstract One-dimensional fragment of first-order logic is obtained by restricting quantification to blocks existential (universal) quantifiers that leave at most one variable free. We investigate this over words and trees, presenting a complete classification the complexity its satisfiability problem for various navigational signatures comparing expressive power with other important formalisms. These include two-variable counting unary negation fragment.